全文获取类型
收费全文 | 1277篇 |
免费 | 484篇 |
国内免费 | 127篇 |
出版年
2024年 | 2篇 |
2023年 | 21篇 |
2022年 | 13篇 |
2021年 | 28篇 |
2020年 | 41篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 96篇 |
2016年 | 113篇 |
2015年 | 70篇 |
2014年 | 104篇 |
2013年 | 108篇 |
2012年 | 120篇 |
2011年 | 96篇 |
2010年 | 69篇 |
2009年 | 134篇 |
2008年 | 84篇 |
2007年 | 93篇 |
2006年 | 106篇 |
2005年 | 88篇 |
2004年 | 86篇 |
2003年 | 52篇 |
2002年 | 51篇 |
2001年 | 46篇 |
2000年 | 38篇 |
1999年 | 30篇 |
1998年 | 32篇 |
1997年 | 24篇 |
1996年 | 19篇 |
1995年 | 11篇 |
1994年 | 14篇 |
1993年 | 18篇 |
1992年 | 10篇 |
1991年 | 3篇 |
1990年 | 16篇 |
1989年 | 7篇 |
1988年 | 2篇 |
排序方式: 共有1888条查询结果,搜索用时 156 毫秒
51.
比较全面地叙述了98海湾危机的成因,英美两国兵力集结情况,重点分析了兵力集结过程中所出现的特点,最后给出了所带来的启示。 相似文献
52.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
53.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
54.
55.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
56.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
57.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
58.
59.
60.